package com.explorati.interview.interview.chapterfifteen;

import com.explorati.interview.interview.chapterfifteen.sort.mergeSort.main;

public class Fibonacci {

	public static int produce(int n) {
		if (n == 0 || n == 1) {
			return 1;
		}

		return produce(n - 1) + produce(n - 2);
	}

	public static void main(String[] args) {
		System.out.println("斐波那锲数列：");
		for (int i = 0; i < 10; i++) {
			System.out.print(Fibonacci.produce(i) + "  ");
		}
	}
}
